Nuclear Fourier Transforms

نویسندگان

چکیده

Abstract The paper deals with the problem under which conditions for parameters $$s_1,s_2\in \mathbb R$$ s 1 , 2 ∈ R , $$1\le p,q_1,q_2\le \infty $$ ≤ p q ∞ Fourier transform $$\mathcal {F}$$ F is a nuclear mapping from $$A^{s_1}_{p,q_1}({\mathbb R}^n)$$ A ( n ) into $$A^{s_2}_{p,q_2}({\mathbb where $$A\in \{B,F\}$$ { B } stands space of Besov or Triebel–Lizorkin type, and $$n\in N$$ N . It extends recent ‘Mapping properties transforms’ (Triebel in Z Anal Anwend 41(1/2):133–152, https://doi.org/10.4171/ZAA/1697 2022) by third-named author, compactness acting same type spaces was studied.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Generalized Fourier Transforms ∗

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...

متن کامل

Quadratic Fourier Transforms

In this paper we shall examine the quadratic Fourier transform which is introduced by the generalized quadratic function for one order parameter in the ordinary Fourier transform. This will be done by analyzing corresponding six subcases of the quadratic Fourier transform within a reproducing kernel Hilbert spaces framework. Center for R&D in Mathematics and Applications, Department of Mathemat...

متن کامل

Fast Fourier Transforms

29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...

متن کامل

Dimensionless Fast Fourier Transforms

This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...

متن کامل

Fuzzy and Fourier Transforms

The fuzzy transform (F -transform for short) is a universal tool for a fuzzy modeling with convincing applications to image processing. The aim of this contribution is to explain the effect of the F transform in image processing. With this purpose, we investigate properties of the Fourier transform over the F -transform components. We prove that the direct F -transform is a low-pass filter. Thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Fourier Analysis and Applications

سال: 2023

ISSN: ['1531-5851', '1069-5869']

DOI: https://doi.org/10.1007/s00041-023-10017-3